EQUATIONAL DESCRIPTIONS OF LANGUAGES
نویسندگان
چکیده
منابع مشابه
Equational descriptions of languages
This paper is a survey on the equational descriptions of languages. The first part is devoted to Birkhoff’s and Reiterman’s theorems on equational descriptions of varieties. Eilenberg’s variety theorem and its successive generalizations form the second part. The more recent results on equational descriptions of lattices of languages are presented in the third part of the paper. Equations have b...
متن کاملSolving Goals in Equational Languages
Solving equations in equational Horn-clause theories is a programming paradigm that combines logic programming and functional programming in a clean manner. Languages like EQLOG, SLOG and RITE, express programs as conditional rewrite rules and goals as equations to be solved. Procedures for completion of conditional equational theories, in a manner akin to that of Knuth and Bendix for unconditi...
متن کاملDuality and Equational Theory of Regular Languages
In their more general form, our equations are of the form u → v, where u and v are profinite words. The first result not only subsumes Eilenberg-Reiterman’s theory of varieties and their subsequent extensions, but it shows for instance that any class of regular languages defined by a fragment of logic closed under conjunctions and disjunctions (first order, monadic second order, temporal, etc.)...
متن کاملSuccinctness of Descriptions of SBTA-Languages
Systolic Binary Tree Automata (SBTA) provide a basic and robust model for one-way parallel computations on binary tree networks of memoryless processors. In this paper we investigate succinctness of descriptions of languages accepted by SBTA, measured in terms of the number of states of minimal SBTA. We study the problem in diierent settings. First we provide various criteria to determine lower...
متن کاملInfinitary Axiomatization of the Equational Theory of Context-Free Languages
Algebraic reasoning about programming language constructs has been a popular research topic for many years. At the propositional level, the theory of flowchart programs and linear recursion are well handled by such systems as Kleene algebra and iteration theories, systems that characterize the equational theory of the regular sets. To handle more general forms of recursion including procedures ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Foundations of Computer Science
سال: 2012
ISSN: 0129-0541,1793-6373
DOI: 10.1142/s0129054112400497